On a Combinatoric Conjecture
نویسندگان
چکیده
Recently, Tu and Deng [1] proposed a combinatorial conjecture on binary string, on the premise that the conjecture is correct they obtain two classes of Boolean functions which are both algebraic immunity optimal: the first class of functions are also bent. The second class are balanced functions, which have optimal algebraic degree and the best nonlinearity up to now. In this paper, from three different sides, we prove this conjecture is true in many cases with different counting strategies. We also propose some problems about the weight equations which is related to this conjecture. Because of the scattered distribution, we predict that a general counting is difficult to obtain.
منابع مشابه
Pole Structure and Gopakumar–vafa Conjecture
We show that the free energy of the topological string admits a certain pole structure by using the operator formalism. Combined with the results of Peng that proved the integrality, this gives a combinatoric proof of the Gopakumar–Vafa conjecture.
متن کاملThe Jacobian Conjecture as a problem in combinatorics
The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools to prove the symmetric Jacobian Conjecture for the case F = X−H with H homogeneous and JH = 0. Other special results are also derived. We pose a combinatorial...
متن کاملPole Structure of Topological String Free Energy
We show that the free energy of the topological string admits a certain pole structure by using the operator formalism. Combined with the results of Peng that proved the integrality, this gives a combinatoric proof of the Gopakumar–Vafa conjecture.
متن کاملA Conjecture on Binary String and Its Applications on Constructing Boolean Functions of Optimal Algebraic Immunity
In this paper, we propose a combinatoric conjecture on binary string, on the premise that our conjecture is correct we mainly obtain two classes of functions which are both algebraic immunity optimal: the first class of functions are also bent, moreover, from this fact we conclude that the algebraic immunity of bent functions can take all possible values except one. The second class are balance...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل